Cayley Automatic Representations of Wreath Products
نویسندگان
چکیده
We construct the representations of Cayley graphs of wreath products using finite automata, pushdown automata and nested stack automata. These representations are in accordance with the notion of Cayley automatic groups introduced by Kharlampovich, Khoussainov and Miasnikov and its extensions introduced by Elder and Taback. We obtain the upper and lower bounds for a length of an element of a wreath product in terms of the representations constructed.
منابع مشابه
Dead End Words in Lamplighter Groups and Other Wreath Products Sean Cleary and Jennifer Taback
We explore the geometry of the Cayley graphs of the lamplighter groups and a wide range of wreath products. We show that these groups have dead end elements of arbitrary depth with respect to their natural generating sets. An element w in a group G with finite generating set X is a dead end element if no geodesic ray from the identity to w in the Cayley graph Γ(G, X) can be extended past w. Add...
متن کاملA SOLOMON DESCENT THEORY FOR THE WREATH PRODUCTS G Sn
We propose an analogue of Solomon’s descent theory for the case of a wreath product G Sn, where G is a finite abelian group. Our construction mixes a number of ingredients: Mantaci-Reutenauer algebras, Specht’s theory for the representations of wreath products, Okada’s extension to wreath products of the Robinson-Schensted correspondence, and Poirier’s quasisymmetric functions. We insist on the...
متن کاملIndistinguishability of Percolation Clusters
We show that when percolation produces infinitely many infinite clusters on a Cayley graph, one cannot distinguish the clusters from each other by any invariantly defined property. This implies that uniqueness of the infinite cluster is equivalent to non-decay of connectivity (a.k.a. long-range order). We then derive applications concerning uniqueness in Kazhdan groups and in wreath products, a...
متن کاملIndistinguishability of Percolation Clusters By
We show that when percolation produces infinitely many infinite clusters on a Cayley graph, one cannot distinguish the clusters from each other by any invariantly defined property. This implies that uniqueness Ž of the infinite cluster is equivalent to nondecay of connectivity a.k.a. . long-range order . We then derive applications concerning uniqueness in Kazhdan groups and in wreath products ...
متن کاملWREATH PRODUCTS AND REPRESENTATIONS OF p-LOCAL FINITE GROUPS
Given two finite p-local finite groups and a fusion preserving morphism between their Sylow subgroups, we study the question of extending it to a continuous map between the classifying spaces. The results depend on the construction of the wreath product of p-local finite groups which is also used to study p-local permutation representations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 27 شماره
صفحات -
تاریخ انتشار 2016